System and method for computing rail car switching solutions in a switchyard with partially occupied classification track selection logic

ABSTRACT

A system for computing car switching solutions in a railway switch yard. The system is computer based and has an input for receiving data conveying information about one or more arrival trains arriving at the switch yard and data conveying information about departure trains to depart the switch yard. A processing entity processes the data and computes car switching solutions for the railcars.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of priority on the previously filedU.S. provisional application entitled “RAILROAD SWITCHYARD MANAGEMENTPROCESS AND RELATED INFRASTRUCTURE” filed on Dec. 30, 2005 by KariMuinonen et al. and which was assigned Ser. No. 60/754,601. The contentsof the above application are incorporated herein by reference.

FIELD OF THE INVENTION

The invention relates to a process for managing operations in a railroadswitchyard. The invention also encompasses a technological platform andindividual components thereof to implement the process.

BACKGROUND OF THE INVENTION

A railroad network normally contains one or more switchyards in whichcars are routed from tracks leading from a departure point to tracksgoing to a destination point. A typical switchyard has four maincomponents, namely receiving tracks, a car switching mechanism, a set ofclassification tracks and a set of departure tracks. Incoming trainsdeliver cars in the receiving tracks. The cars are processed by theswitching mechanism that routes individual cars to respectiveclassification tracks.

Two types of switching mechanisms are in use today. The first one is ahump switch. Switch yards that use a hump switch are referred to as humpyards. A hump switch yard uses a hump over which a car is pushed by alocomotive. At the top of the hump the car is allowed to roll on theother side of the hump under the effect of gravity. Retarders keep thecar from reaching excessive speeds. The hump tracks on which the carrolls down the hump connect with the classification tracks. A trackswitch establishes a temporary connection between the hump tracks and aselected one of the classification tracks such that the car can roll inthe classification tracks. A departure train is constituted when therequisite number of cars has been placed in a set of classificationtracks. When the departure train leaves the switchyard, the set ofclassification tracks become available for building a new departuretrain.

The second type of switch mechanism is a flat switch. The principle isgenerally the same as a hump yard except that instead of using gravityto direct cars to selected classification tracks, a locomotive is usedto push the car from the receiving tracks to the selected set ofclassification tracks.

In order to increase the efficiency of switching operations railwaycompanies have developed the concept of car blocking. Under thisconcept, a block of cars, hence the name “blocking”, may be logicallyswitched as a unit in a switch yard. A block is established on a basisof certain properties shared by the cars belonging to the block. Forinstance cars that have a common destination point on their route can beblocked together. A “block” is therefore a logical entity that helpsmaking switching decisions. For reference it should be noted thatgenerally, two types of blocks exist. There is the so called “yardblock” and a “train block”. For clarity, the term “block” alone in thepresent specification encompasses either a yard block or a train block.

The principle of blocking, either yard blocking or train blockingincreases the efficiency with which cars are processed at switch yards.However, it also brings constraints. Very often a train block must beassembled from cars that arrive on different incoming trains. The trainblock will be complete and available for departure only when all thecars that make up the train block have arrived at the switch yard. Ifone or more of the cars are delayed the train block cannot be completedand the entire departing train that pulls this train block may leavewithout the train block. Such occurrence may create a cascading effectthroughout entire segments of the railroad network and have significantfinancial repercussions for the railroad operator. Specifically, it isnot uncommon for an operator to guarantee car arrival times to customersand delays incur financial penalties that may be significant.

Against this background, it can be seen that a need exists in theindustry to develop more refined processes to manage operations in aswitch yard such as to increase the efficiency with which cars areswitched.

SUMMARY OF THE INVENTION

As embodied and broadly described herein the invention also provides asystem for computing car switching solutions in a railway switch yardcontaining a plurality of classification tracks wherein a firstclassification track holds a first train block and a secondclassification track holds a second train block, the system comprising:

-   -   a) a processing entity for:        -   i) computing available space in the first classification            track for receiving cars from a third train block that is            different from the first and second train blocks;        -   ii) computing available space in the second classification            track for receiving cars from the third train block;        -   iii) selecting among the first and second classification            tracks at least in part on the basis of the computing of            available space;        -   iv) computing switching solutions for cars of the third            block on the basis of the selecting;    -   b) an output for releasing data conveying one or more of the car        switching solutions.

As embodied and broadly described herein the invention also includes amethod for computing car switching solutions in a railway switch yardcontaining a plurality of classification tracks wherein a firstclassification track holds a first train block and a secondclassification track holds a second train block, the method comprising:

-   -   a) computing with a computing entity an available space in the        first classification track for receiving cars from a third train        block that is different from the first and second train blocks;        -   i) computing with the computing entity available space in            the second classification track for receiving cars from the            third train block;        -   ii) selecting among the first and second classification            tracks at least in part on the basis of the computing of            available space;        -   iii) computing switching solutions for cars of the third            block on the basis of the selecting;    -   b) an output for releasing data conveying one or more of the car        switching solutions.

BRIEF DESCRIPTION OF THE DRAWINGS

A detailed description of examples of implementation of the presentinvention is provided hereinbelow with reference to the followingdrawings, in which:

FIG. 1 is a schematical illustration of a hump switch yard;

FIG. 2 is a high level block diagram of a prior art computer basedswitch yard management system;

FIG. 3 is a high level block diagram of a computer based switch yardmanagement system according to a non-limiting example of implementationof the invention;

FIG. 4 is a more detailed block diagram of the system shown in FIG. 3;

FIG. 5 is a graph illustrating the process of allocating two separatetrain blocks of cars to a single classification track;

FIG. 6 is a flowchart illustrating an iterative process for computingcar switching solutions according to a non-limiting example ofimplementation of the invention;

FIGS. 7 and 8 are more detailed flow charts of the general processillustrated in FIG. 6;

FIG. 9 is a flowchart illustrating a logical process for selecting anoccupied a classification track in which to switch a car;

FIG. 10 is a flowchart illustrating a logical process for determining ifa car should be rehumped based on small train block size;

FIG. 11 is a flowchart illustrating a logical process for determining ifa car should be rehumped based on arrival rate;

FIG. 12 is a flowchart illustrating a logical process for selecting aclassification track to receive only a portion of a train block;

FIGS. 13 and 14 illustrate logical processes for performing empty carsubstitution.

In the drawings, embodiments of the invention are illustrated by way ofexample. It is to be expressly understood that the description anddrawings are only for purposes of illustration and as an aid tounderstanding, and are not intended to be a definition of the limits ofthe invention.

DETAILED DESCRIPTION

FIG. 1 is an illustration of a hump switching yard in which themanagement process of the invention can be implemented. The humpswitching yard 10 has four main components namely receiving tracks 12, ahump 14, classification tracks 16 and departure tracks 17. The receivingtracks 12 include railway sections in which an incoming train deliverscars to be switched.

The receiving tracks 12 lead to the hump 14. The hump 14 includes a setof tracks 20 that lead to the hump crest 18 that is the highestelevation of the hump 14. Cars are pushed by a locomotive on the tracks20 up to the hump crest 18 at which point the car rolls down the hump 14by gravity toward the set of classification tracks 16. The car passesthrough retarders 22 that will reduce its speed allowing it to gentlycoast in anyone of the selected classification tracks 16. A track switch24, located downstream the retarders 22 temporarily connects the humptrack 12 to a selected one of the classification tracks 16 such as todirect the car to the desired classification track 16.

The receiving tracks 12, therefore, form a switching queue in which carsthat are delivered to the switching yard 10, await to be switched.

The classification tracks 16 lead to the departure tracks 17.Specifically, the classification tracks are arranged into groups, whereeach group leads to a departure track 17. The hump switch yard 10 shownin the drawings includes 10 classification tracks organized into twogroups of five tracks. Each group of five tracks connects to thedeparture track 17.

Generally, the classification tracks 16 are used to assemble trainblocks. Train blocks are pulled out of the classification tracks intothe departure tracks 17 where the actual departure train is built. Thedeparture tracks 17 allow assembling trains having more cars than asingle classification track can hold. When a complete train (shorttrain) is assembled into a single classification track 16, the departuretrain leaves that track directly by passing through the departure track17.

It should be appreciated that FIG. 1 is a very simplified illustrationof a hump switch yard in that the number of tracks shown has beensignificantly reduced for clarity purposes. An average size hump yardtypically contains many more classification tracks than what is shown inFIG. 1. For example it would not be uncommon for a switchyard to have 80or more classification tracks organized into physical groups of tracks,where each group connects to a departure track. In addition, there willnormally be a larger number of departure tracks 17 than what appears onthe drawing.

The hump switch yard 10 also includes a reswitching track that allows to“recirculate” cars from a position downstream the switch 24 to aposition upstream the switch 24. In a typical hump switch yard, such asthe yard 10 the reswitching track is called “rehump track”. The rehumptrack is shown at 26 in FIG. 1. The rehump track 26 originatesdownstream the track switch 24 and lead to the hump tracks 20 at thebase of the hump 20. The purpose of the rehump tracks 26 is to provide abuffering mechanism where one or more cars can be temporarily put instorage without blocking the flow of other cars through the hump switchyard 10. For instance, situations may arise where one or more cars inthe receiving tracks 12 cannot be switched in any one of theclassification tracks 16. This may be due, for example to the lack ofspace availability in the classification tracks 16. It is commonpractice for a hump switch yard 10 to periodically hump the cars in therehump tracks 26. Such rehumping involves pushing the cars over the hump20 such that they can be switched to a selected classification track 16.If a car cannot be routed to any one of the classification tracks 16 itis put back in the rehump tracks 26 for a new humping cycle.

The following description of a non-limiting example of implementation ofa switch yard management process will be done in connection with a humpswitch yard 10 of the type described earlier. However, it should beexpressly noted that the principles of the invention apply equally wellto a flat switch yard. Accordingly, the invention should not be limitedto a hump switch yard but encompasses a flat switch yard as well. A flatswitch yard operates generally in the same way as described earlier inthat incoming trains deliver cars at the input side of the flat switchyard, a switching device routes the individual cars to classificationtracks to assemble departure trains in departure tracks.

FIG. 2 illustrates a block diagram of a prior art control system 28 foruse in managing the operations of a hump switch yard 10. Specifically,the control system 28 includes two main components, namely the ServiceReliability System (SRS) component 30 and the Hump Process ControlSystem (HPCS) 32. The SRS component 30 is in essence a railway trafficmanagement system that keeps track of the rolling stock inventorythroughout the network. It is used to manage the flow of railway trafficover a complete railway network or a portion thereof. The SRS component30 is a computer based system that reflects the railway operations byshowing information on trains, schedules, waybills, trip plans and traindelays. The SRS component 30 has a number of sub-systems that areintegrated to one another. Some of the sub-components are brieflydescribed below:

-   -   Waybill—a computer file that provides details and instructions        on the movement of cars. Cars and units cannot move without a        waybill;    -   Service Scheduling—the service scheduling sub-component is based        on a trip plan that specifies the events a shipment must follow        from origin to destination. A trip plan identifies the train        connections for each car and provides a destination Estimated        Time of Arrival (ETA). The service scheduling sub-component        continuously monitors the movement of each shipment and compares        its progress to the trip plan. If the service scheduling        determines that a shipment will not meet the established        requirements, it triggers alarms;    -   Yard Operating Plan/Daily Operating Plan (YOP/DOP)—the YOP        sub-component defines how assets (crews, cars, locomotives and        tracks) are allocated to support yard related activities. The        DOP is derived from the YOP and contains instructions for        industrial assignments;    -   Yard, Industry and Train (YIT)—the YIT sub-component allows        users to report train and car movements such as train arrivals        and departures, yard switches, exchange of cars with other        railroads, and the placing and pulling of cars at a customer        sidings.    -   Intermodal—this sub-component includes functions for gating-in,        gating-out, assigning, ramping, de-ramping as well as        maintaining inventories of Intermodal equipment.

The SRS component 30 includes a processing function that is illustratedas a single block, but it can be implemented also in a distributedfashion.

It should be expressly noted that the SRS component 30 is merely anexample of a railway traffic management system and other railway trafficmanagement systems can be used without departing from the spirit of theinvention.

The HPCS component 32 operates the track switch in the hump switch yard10. Essentially, the HPCS component 32 is a car switch control systemthat determines on the basis of inputs the position of the track switch24 such that a car or a series of cars over the hump, will be directedto the desired classification track 16. Broadly stated, the HPCScomponent 32 has two main goals, namely:

-   -   Deliver the cars to the correct classification track 16;    -   Insure that the cars will arrive in the classification track 16        fast enough to reach the cars already in the track but slow        enough for a safe coupling (or reach the far end of the track if        it is empty);

As in the case with the SRS component 30, the HPCS component 32 isillustrated as a single block but it can be implemented in a distributedfashion.

It should be expressly noted that the HPCS component 32 is merely anexample of a car switch control system and other car switch controlsystems can be used without departing from the spirit of the invention.

As shown by FIG. 2 a human intervention 34 is required to interface theSRS component 30 and the HPCS component 32. Specifically, the SRScomponent identifies the trains that are scheduled to arrive at the humpswitch yard 10 and the trains that are scheduled to depart the humpswitch yard 10. On the basis of this information a hump list is manuallyproduced. The hump list determines in which classification track thevarious cars will go. The hump list is then loaded into the HPCScomponent 32. The HPCS component 32 performs the switching as the carsare humped, according to the specific switching instructions in the humplist.

In order to simplify the car switching logic, it is customary to assignclassification tracks 16 to destinations. For instance there is the“Edmonton” classification track, the “Montreal” classification track,etc. Cars that go to Edmonton are switched to the Edmontonclassification track, cars that go to Montreal are switched to theMontreal track, etc.

Note the communication link 35 between the HPCS component 32 and the SRScomponent 30. This link 35 illustrates the exchange of data between thetwo components, for instance the HPCS component 32 notifying the SRScomponent 30 of events or conditions occurring in the hump switch yard10.

FIG. 3 is a block diagram of control system 44 for use in managing theoperations of the hump switch yard 10, according to a non-limitingexample of implementation of the invention. The control system 44includes three main components two of which are shared with the priorart control system 28 described earlier. Specifically, the controlsystem 44 includes the SRS component 30, the HPCS component 32 and aDynamic Track Allocation (DTA) controller 46. The DTA controller 46 isresponsible for allocation of cars to the classification tracks 16.

FIG. 4 is a block diagram of the DTA controller 46, showing therelationships with the SRS component 30 and the HPCS component 32. TheDTA controller 46 has a computing platform including a processor 47 thatcommunicates with a machine readable storage unit 49, commonly referredto as “memory” over a data bus. Inputs and outputs (I/O interface) 51allow the DTA controller 46 to receive and send data to the SRScomponent 30 and the HPCS controller 32, via the SRS component 30. Inaddition, the I/O 51 communicates with a user interface 53 that allowsthe DTA controller 46 to communicate information to the yard master andreceive commands or other inputs from the yard master. In essence, theuser interface 53 shows the yard master the switching solutions that theDTA controller 46 is developing. Those switching solutions can beimplemented either automatically, i.e. pending an input from the yardmaster that stops the process, the proposed switching solutions areexecuted, or they may require explicit conformation from the yardmaster. For instance unless the yard master inputs at the user interface53 a command to explicitly implement or authorize the switching solutionpresented by the DTA controller 46 on the user interface 53, no actionis taken by the system.

Note that while the diagram at FIG. 4 depicts the DTA controller 46 as asingle unit, it can also have a distributed architecture withoutdeparting from the spirit of the invention.

The functionality of the DTA controller 46 is software defined. In otherwords, the logic that determines how cars are to be switched isimplemented by executing software by the processor 47. The software inthe form of program code is stored in the memory 49. The software readsdata inputs received from the SRS component 30, and from the userinterface 53. On the basis of those inputs, the DTA controller 46generates outputs to the user interface 53. The output to the userinterface 53 is intended to display information to inform the yardmaster on the switching solutions the DTA controller 46 has reached.Optionally, an output may also be directed to the HPCS component 32,which contains switching commands that determine the positions of thetrack switch 24 and effectively implement the switching solutionsdeveloped by the DTA controller 46.

It should be expressly noted that the present invention does notabsolutely require the generation of control signals to the HPCScontroller 32. While this option is considered advantageous, variantscan be envisaged where there is in fact, no direct command given by theDTA controller 46 to the HPCS component 32. For instance, the DTAcontroller 46 can compute switching solutions that are presented to theyard master or another operator and manually implemented or manuallyauthorized.

As indicated earlier, the DTA controller 46 determines how the humpswitch yard 10 will allocate cars in the classification tracks 16. Thisis done on the basis of various parameters that will be discussed below.In addition, the DTA controller 46 is provided with some degree offlexibility in determining the make up of train blocks such as, forexample, collapse train blocks when it is not appropriate to continueassembling them or splitting big train blocks into smaller ones in orderto make better use of existing space in classification tracks 16.Another feature of the DTA controller 46 logic is allowing a dynamic carre-distribution. This is particularly suitable for empty cars that needto be delivered by the railroad operator to the customer or car owner.

In the example illustrated in FIG. 4, the DTA controller 46 logicallyresides between the SRS component 30 and the HPCS component 32. As suchthe DTA controller 46 receives information from the SRS component 30about:

-   -   Incoming trains (trains to be received in the hump switch yard        10), in particular:        -   Identification of the train (Train ID)        -   The Expected Time of Arrival (ETA);        -   Point of origin;        -   Destination;        -   Identification of the train blocks that make up the train;        -   The number of cars in each train block;        -   The identification of each car (car ID);        -   The destination of the car;        -   The route of the car;        -   If the car carries cargo, the type of cargo; and        -   If the car is empty the customer that has requested the car            to be moved.    -   Departure trains (trains the switch yard 10 is expected to        assemble);        -   Identification of the train (Train ID)        -   The Expected Time of Departure (ETD);        -   Identification of the train blocks that make up the train;        -   The number of cars in each train block;        -   The identification of each car (car ID);        -   The destination of the car;        -   The route of the car;        -   If the car carries cargo, the type of cargo; and        -   If the car is empty, the customer that has requested the car            to be moved.

In order to make classification track assignments to individual cars,the DTA controller 46 creates representations in the memory 49 of therolling stock that transits through the hump switch yard 10 by usinghierarchal objects. Generally, three types of objects exist:

-   -   A train object. A train object is associated with each train        (arrival train or departure train) and it has properties such        as:        -   A train identifier (train ID);        -   Expected time of arrival (ETA);        -   Origin;        -   Destination;        -   Route; and        -   Identification of train blocks that make up the train.    -   A train block object. A train block object is associated with a        block of cars and has the following properties:        -   A train block identifier (train block ID);        -   Number of cars making up the train block;        -   Identity of the cars making up the train block;        -   Destination of the train block; and        -   Route of the train block from the origin to the destination.    -   A yard block object. A yard block object is associated with a        block of cars and has the following properties:        -   A yard block identifier (yard block ID);        -   Number of cars making up the yard block;        -   Identity of the cars making up the yard block;        -   Origin of the yard block;        -   Destination of the yard block; and        -   Route of the yard block from the origin to the destination.    -   Car objects. A car object is associated with a single car and        has the following properties:        -   Car identifier (car ID);        -   Car owner;        -   If car carries cargo the type of cargo;        -   If car is empty the customer identifier that has requested            the car to be moved;        -   Origin;        -   Destination; and        -   Route between origin and destination.

Normally, train objects that represent incoming trains will cease toexist when the train arrives at the hump switch yard 10 since the trainis dismantled. An exception to this is a situation where the incomingtrain transits through the hump switch yard 10 in which case it remainsintact. Departing trains are represented by train objects that begintheir existence at the hump switch yard 10, having been assembled fromcars that originate from one or more dismantled incoming trains.Incoming train block objects may cease to exist if the train block isdisassembled and the individual cars are used to make up other trainblock objects. For example a train block arriving at the hump switchyard 10 may contain cars having different destinations. For the sake ofthis example, say that half of the cars need to be delivered to city Awhile the other half to city B. In such case the train block isdisassembled and the cars that go to city A are switched to form aloneor in combination with other cars from a different train a new trainblock that will travel to city A. The cars directed to city B areswitched in a similar manner. In this situation, two new train blocksare created at the hump switch yard 10, from one or more incoming trainblocks. Another possibility is for train blocks to be modified, insteadof ceasing to exist or beginning to exist. A train block can be modifiedby augmenting the train block, such as by adding to it one or more carsor diminished by removing from it one or more cars. Finally, a trainblock may remain unchanged such as when it simply transits through thehump switch yard 10. In such case, the train block is physicallydismantled into individual cars but the switching operation is conductedsuch as to reassemble the original train block. Alternatively, the trainblock can be routed directly to the departure tracks 17 such as tocircumvent the switch 24.

As far as individual car objects, they remain unchanged as they transitthrough the hump switch yard 10.

The DTA controller 46 receives from the SRS component 30 data thatdescribes the incoming trains so that the DTA controller 46 candetermine the details of the rolling stock to be processed. The DTAcontroller 46 also receives information on the departure trains that thehump switch yard 10 is expected to assemble.

In a specific example of implementation, the DTA controller 46 receivesform the SRS component 30 the following information:

-   -   The trains scheduled to arrive to the hump switch yard 10. The        SRS component 30 simply provides the identity of the train (the        train ID);    -   The trains that the SRS system expects the hump switch yard to        make. The SRS component simply provides the identity of the        train (train ID).

Once the DTA controller 46 is made aware of incoming trains and therequirement to build departure trains, the train ID information allowsthe DTA controller 46 to determine all the necessary information down tothe individual car. More particularly, the train ID allows determiningthe properties of the train object and the properties of the train blockobjects derived via the train object and the properties of the carobjects derived via the train block objects. This data will then allowthe DTA controller 46 to compute switching solutions.

It should be expressly noted that the above description of the manner inwhich information is provided to the DTA controller 46 is strictly anexample and should not be constructed in any limiting manner. Manydifferent ways to deliver information to the DTA controller 46 existthat allow characterizing the incoming trains and the departing trainswithout departing from the spirit of the invention.

The various functions and features of the DTA controller 46 according toa non-limiting example of implementation will be described below inconjunction with the process flowchart in FIGS. 6 and 7. The flowchartsinclude a decision tree that allows the DTA controller 46 to find carswitching solutions based on specific cases. It is to be expressly notedthat the following description is provided only as an example of theoperation of the DTA controller 46 and should not be used in a manner tolimit the scope of the present invention.

Generally speaking, the DTA controller 46 implements an iterativeprocess that periodically computes car switching solutions. Thosesolutions are of temporary nature in the sense that they are re-computedat each iteration cycle. The switching solution is frozen in time whenthe car is committed for switching. A car that is being pushed over thehump up to the hump crest 18 is considered committed for switching.Generally, a car is “committed for switching” when it is close enough tothe switch 24 such that the condition of the hump switch yard 10, inother words the parameters that determine or influence the switchingsolution computed by they DTA controller 46 are unlikely to changesignificantly until the actual switching event occurs. In other words,the latest switching solution in existence when the car has reached aposition in the hump switch yard 10 where it is “committed forswitching” is likely to remain valid until the car is actually switchedsince the events and conditions in the hump switch yard 10 are unlikelyto change in an appreciable manner during the time frame the cartransits from the position “committed for switching” to the switch 24.

The flowchart on FIG. 6 illustrates generally the iteration cycle. Theprocess enters the decision block 600 where the DTA controller 46determines if the car is committed for switching. In the affirmative,the previous solution (the flowchart assumes that a previous solutionhas been computed) is maintained. In such case, this solution can bepresented to the yard master of the hump switch yard 10 as being thefinal solution.

If the car is not yet committed for switching, the process continues tostep 602 which computes a switching solution which is either an updatedsolution or a first solution for this car. The solution is stored by theDTA controller 46 and will be used as a final solution if, during thenext iteration cycle, the car is found to be committed for switching.The process then loops back to decision step 600 and it is thuscontinuously repeated.

When the switching solution computation step 602 is invoked it willprocess information to select a classification track 16 for each car orblock of cars to be humped. Cars are humped in a given sequence whichtypically is the sequence in which they arrive at the hump switch yard10. In general, the track assignment logic that is implemented by theswitching solution computation step 602 has the followingcharacteristics. It is to be expressly noted that the characteristicsdiscussed below are not to be considered limiting as they may changewithout departing from the spirit of the invention. In particular, asystem that omits a particular characteristic, uses an alteredcharacteristic or implements a new characteristic should not beconsidered outside the scope of the invention:

1. Expected Switch Time in Computing Switching Decisions.

-   -   The switching solution computation step 602 uses as a basis for        finding a switching solution for a given car, the expected        switch time for that car. This roughly represents the time at        which the switching solution computation step 602 expects the        car to be switched. The switching solution will vary with the        events and conditions of the hump switch yard 10 at the expected        switch time. For example, if the expected switch time is prior        the time the train is scheduled to depart then the switching        solution will attempt putting the car in a classification track        such that it can be made part of the train. On the other hand,        if the switch time is after the departure time of the train then        it will be plain that different options need to be considered        since that particular train is no longer available.    -   The expected switch time is an approximation that takes into        account one or more factors, as it will be discussed later in        connection with a specific example.

2. Dynamic Classification Track Assignment

-   -   Switching solution computation step 602 dynamically assigns        classification tracks to train blocks. By “dynamic” is meant        that the classification tracks are not constrained to certain        destinations or trip plans. In other words, at some point a        classification track may be assigned to train block that goes to        destination A and sometime after the train block is completed or        pulled, the same classification track is assigned to a train        block that goes to destination B. A consequence of the dynamic        classification track assignment is that a classification track        may contain two or more blocks having different destinations, in        other words they are associated with different departure trains.        In this example, the train blocks are in order of their time of        departure. The train block farther from the hump 16 departs        before or at the same time as the train block closer to the hump        16. FIG. 5 shows this characteristic in greater detail. The        graph shows a single classification track having a total of 50        cars capacity and the number of cars that are assigned to the        classification tracks at different times. Initially, only cars        that belong to train block A are being assigned to the        classification tracks. Train block A is closed at 9:30. The        closure occurs either because the train block is complete (all        the cars that originally form part of the train block have        arrived on time and are delivered to the classification track)        or closed prematurely by the DTA controller 46. At about 9:30        cars from train block B are delivered to the classification        tracks. At 12:30 train block A is pulled out of the        classification tracks and only cars from train block B remain.        This example illustrates a situation where cars that belong to        different train blocs simultaneously reside in the same set of        classification tracks. By adequately controlling when the first        train block (the one farthest from the hump 16) closes and the        respective pull times of the train blocks (the train block        farthest from the hump 16 is pulled at an earlier time than the        train block closest to the hump 16), the process can be        adequately managed without creating a conflict such that a car        or a train block in the classification tracks is prevented from        being pulled out by a car or a train block of cars having a        latter pull time.    -   In the above example, train blocks A and B are part of a        different train.

3. Car Arrival Time Considerations

When determining if available space exists in a given classificationtrack the DTA controller 46 will take into account the arrival times(ETA) of the various cars in the hump switch yard 10.

4. Pull Time Considerations

When determining if available space exists in a given classificationtrack the DTA controller 46 will take into account the time at which oneor more of the cars that are presently switched in the classificationtrack or scheduled to be switched therein will be pulled to make upspace.

5. Multiple Classification Track Assignment Modes.

-   -   Optionally, the DTA controller 46 has the capability to accept        static assignments in connection with one or more of the        classification tracks 16. A static assignment can be maintained        permanently or semi-permanently and it associates the        classification track 16 with a departure train having a given        destination. Such static assignments, if used, would normally be        programmed in the DTA controller 46 in a manner to allow the        switching solution computation step 602 to take this factor into        account when computing switching solutions. The static        assignments can be specified to the DTA controller 46 via the        user interface 53 by the yard master. For example, the yard        master of the hump switch yard 10 may decide that one or more        specific classification tracks will be dedicated for the next 12        hours to cars on the train going to Toronto. Via suitable inputs        on the user interface 53 the track identifier(s) is entered and        the destination associated with that track(s) as well or any        other suitable parameter. When the switching solution        computation step 602 sees a car to be switched that is directed        to a destination other than Toronto, it automatically discounts        the statically assigned classification track(s). On the other        hand, should a car present itself that goes on the Toronto        train, then the switching solution computation step 602 will        consider the statically assigned classification track(s) for        that car. The system can be designed to handle static        assignments in a rigid manner such as for instance, direct cars        that go to a destination to which one or more classification        tracks 16 are statically assigned only to those classification        tracks. Another option is to use some degree of flexibility in        that the static classification tracks are considered first and        if no space is available, then the cars are allowed to use a        classification track having a dynamic assignment. The static        assignment can be removed in the same fashion as it was applied,        namely through the user interface 53.    -   The DTA controller 46 holds in its machine readable storage        media a representation of the status of each classification        track 16. This may be in the form of any suitable machine        readable file stored in the memory 49 (shown at FIG. 4). The        file contains the identifiers of the various classification        tracks and a reference for each classification track as to        whether it is to be used for dynamic assignment or for a static        assignment. When used for a static assignment the file may also        specify certain characteristics such as the destination the        classification track is to be assigned to, and any other        parameter that may be useful. Another such parameter is the time        frame during which the static assignment is maintained. In such        instance, the yard master enters the end points of the time        frame during which the static assignment is to be maintained        along with any other suitable parameters. The end points would        normally be the beginning of the time frame and the end of the        time frame. When the time frame expires the DTA controller 46        may automatically switch the classification track 16 to the        dynamic assignment mode, may issue an alert to the yard master        or do both, in other words automatically switch the assignment        mode and issue a notification such that the yard master is made        aware of the event.    -   When the yard master changes classification track assignments        via the user interface 53, the changes are reflected in the file        such that during execution of the switching solution computation        step 602 the logic will be made aware of the correct assignment        of each classification track 16.    -   Finally, note that assignments can be specified via the user        interface 53 on the basis of classification track groups instead        of being done on a single track basis. For instance, referring        back to FIG. 1, the yard master may simply specify the        assignment of an entire five classification track group.

6. Classification Track Grouping.

-   -   This notion can be implemented in hump switch yards 10 where the        classification tracks are physically arranged into groups, as        shown for example in FIG. 1. The logic implemented by the DTA        controller 46 is designed such that a departure train that is to        be assembled will be assigned a most preferred group of        classification tracks 16 and a second most preferred group of        classification tracks 16. In other words, the cars that go in        the train will be preferably put in the classification tracks of        the most preferred group. If there is no space in the most        preferred group, the second most preferred group will be        considered. Optionally, a third most preferred group can also be        used, such as to provide classification track space when the        second most preferred group is full.    -   The notion of a preferred group avoids scattering the train        blocks for a given departure train all over the classification        tracks. The logic of establishing a preferred classification        track group is to try placing as many of the train blocks as        possible that belong to the same train in the fewest possible        classification tracks that are physically close to one another.        This simplifies the train block pulling operation by comparison        to a situation where the train blocks are scattered over many        classification tracks that may be physically remote from one        another.    -   Preferably, the most preferred set of classification tracks and        the second most preferred set of classification tracks are        physically close to one another such as to simplify the train        block pulling operations. The hump switch yard 10 shown in FIG.        1 illustrates two groups of classification tracks and one of        those could be designated as a most preferred while the other as        the second most preferred. Thus, the most preferred group and        the second most preferred group are immediately adjacent to one        another. The same logic can also be followed in connection with        the third most preferred group, in that it can be selected such        that it is close to the most preferred and second most preferred        group and preferably immediately adjacent thereto.    -   It is important to appreciate that the notion of preferred        groups is not restricted to switch yards, either hump yards or        flat yards that have physical groups of the type shown in        FIG. 1. Even when the classification tracks 16 are not        physically grouped, they can still be logically associated into        groups. In such case, groups can be defined by assigning two or        more adjacent classification tracks to a group, either most        preferred, second most preferred, etc.    -   Generally, groups of classification tracks are associated with        departure trains. Once a preferred group has been established,        either a physical group or a logical group, that group is        maintained until all the cars scheduled to depart have been        delivered in the classification tracks. After that, the        association between the classification track groups and the        train is dissolved, in other words groups can be assigned to a        new train to be built.    -   It should be noted that the classification track groups do not        need to be completely empty of cars before being assigned to a        new train. The assignment process is essentially a logical step        and a re-assignment can occur as long as there is space in the        group to receive cars for a new train. The two following        situations can arise:        -   The group is closed to cars that belong to a new train as            long as no more cars that belong to the current train are            scheduled to arrive in the group. Once all cars have            arrived, the group of classification tracks can begin            receiving cars associated with the new train.        -   The group is open to cars from a new train as long as there            is space for the cars on any one of the classification            tracks that make up the group. This implies that cars for            the current train can still be received in any other            classification track of the group. Consider for example            classification track group made up of 10 tracks. Track 9            holds a train block of cars that is complete. The other            tracks 1-8 and 10 hold train blocks that are still            incomplete. The entire group can now be assigned to a new            train since cars for the new train can be placed in track 9,            while cars for the current train are still arriving in the            other classification tracks of the group. In this example,            the group is assigned during a certain time period to two            different trains.    -   The DTA controller 46 holds in its machine readable storage        media a representation of the different classification track        groups, specifically, identifying which classification tracks        belong to which group and which departure train is currently        assigned to which classification track group. In the case of a        physical grouping of the type shown in FIG. 1, the        identification of the classification tracks with relation to the        groups will likely be the same as the physical layout and        unlikely to change over time. However, in instances where no        physical groupings exist, the number and identity of the        classification tracks that make up the groups can dynamically        change. The assignment of a given classification track group        (most preferred, second most preferred, third most preferred,        etc.) can be done manually by the yard master This operation is        effected via the user interface 53 or can also be done        automatically

7. Non-Preferred Classification Track Groups.

-   -   In selecting which classification track groups to assign to a        departure train as most preferred, second most preferred, third        most preferred etc, there is a possibility, as discussed in the        previous example, to co-assign the same group of classification        tracks to different trains. In such, case consideration is given        to the relationship between the departure times of the trains.        Classification track groups will not be co-assigned to trains        that depart at times that are close to one another in order to        avoid a potential congestion on the tracks. Such congestion is        likely to arise if train blocks for different trains are pulled        at about the same time from the same group of classification        tracks.

8. Rehumping for Pull Time.

-   -   Cars to be switched to classification tracks may be sent to the        rehump tracks 26 when the departure time of the train block to        which they belong is far away. This avoids a situation where a        few cars may train block a classification track for a long time        period necessary for all the other cars that belong to the train        block to arrive. In this case the buffering function of the        rehump tracks 26 can be put to use. The decision to temporarily        put cars on the rehump tracks takes into account the following        factors, individually or in combination with one another:        -   a. The pull time of the train block. For example if the            train block is to be pulled many hours away, it is a good            candidate for rehumping;        -   b. The size of the train block. If the train block is small,            say a few cars, it is possible to allow all the cars that            belong to the train block to accumulate in the rehump tracks            26. Then the cars of the entire train block are humped and            placed in the appropriate set of classification tracks;        -   c. The rate at which the cars of a given train block arrive.            Even if the train block is large and may not be contained            entirely in the rehump tracks, at least some of the cars            that arrive first can be held temporarily in the rehump            tracks until space is available in any set of classification            tracks. At this point, the cars stored in the rehump tracks            can be humped in the selected set of classification tracks            and the remaining cars that make up the train block are            directed to the selected set of classification tracks.

9. Rehumping for Arrival Rate.

-   -   Cars to be switched to classification tracks may be sent to the        rehump tracks 26 when they arrive at a very slow rate. This        could occur in connection with a given train block and where the        first few cars of the train block arrive very slowly. Those cars        can then be directed to the rehump tracks and held there until        the rate of arrival of the cars for that train block increases,        at which point the cars are switched into classification tracks.

10. Preemptive Closure of a Train Block.

-   -   If a train block is kept open for a long time period, cars that        belong to other train blocks may have to be sent to the rehump        tracks. Rehumping cars consumes resources which translates into        additional operational costs. When a large number of cars may        need to be rehumped, it may make more sense to close the train        block and thus open space on the classification tracks. When a        train block is prematurely closed, the cars arriving post        closure that were intended for the closed train block need to        handled somehow. For instance the late cars can be assembled        into a new train block.

11. Empty Car Substitution.

-   -   Empty cars, are associated with a trip plan, as any other        railway car. To improve the overall car switching process at the        hump yard 10, empty car (a car that does not carry cargo and is        directed to a location to pick up a shipment) substitution can        be implemented where a given empty car that is currently        available for switching can be substituted for another empty car        that may be late or unavailable for switching. In addition to        the physical car substitution, the records in the SRS component        30 are updated to indicate that the first car (the car that is        available) has now taken the place of the second car (the        unavailable car) in the trip plan of the second car.

The exemplary characteristics outlined above will be better understoodwith relation to the following specific examples. It should be expresslynoted that characteristics are provided as examples and should not beinterpreted as being essential to the invention in any way.

FIG. 7 is a high level flowchart of the logic that is implemented by theDTA controller 46 to switch cars, in particular the step 602 shown atFIG. 6. The decision tree represented by the flowchart is followedsequentially. If at anyone of the steps a switching solution is foundthe car is switched and the process terminates. If no solution is foundat a particular step the process continues to the next step.

The process starts at 900. At that decision step the DTA controller 46determines if the car is on “pull back”. A car on “pull back” is a carthat is currently in position to be pushed over the hump 20 (or being inposition at the hump 20); therefore it is committed for switching.Accordingly, if the decision step 900 is answered in the affirmative anyprevious switching solution computed for this car by the DTA controller46 is presented as final solution over the user interface 53 (step 901).If this assessment is answered in the negative the process continues atstep 902 that determines if the yard block to which the car is assignedexists. This is effected by looking at the data made available to theDTA controller 46 from the SRS component. This data includes informationabout the yard blocks in the hump switch yard 10. If no yard blockexists for the car, in other words the decisions step 902 is answered inthe negative the car is sent to rehump at step 904. Once in the rehumptracks the car will be periodically rehumped and the above describedprocessing done again. If at this time a yard block for the car is foundthen the process would branch to decision step 906.

Decision step 906 determines if the yard block to which the car isassigned is a static train block. A static train block is a train blockthat is associated with a static classification track. As discussedearlier, a static classification track is one that may be assigned tocars or train blocs associated with a departure train going to apredetermined destination. Accordingly, if the decision step 906 isanswered in the affirmative, the switching solution is determined byconsulting the representation of the classification tracks in the DTAcontroller 46. As previously indicated, this representation providesinformation on the statically assigned classification tracks and detailsabout such assignment, in particular the destination of the blocks puton those classification tracks.

As discussed earlier, a static classification assignment can be done viathe user interface 53.

If no static classification track 16 has been assigned for the car, theprocess continues to step 910 that queries if a train block exists forthe car. This determination takes into account the expected switch timeof the car. If an outbound train cannot be found that carries the trainblock, then it is not possible to perform a dynamic track assignment.The car is therefore directed to a rehump track 24 (step 912).

The computation of the expected switch time for a given car is anapproximation of the time at which the car is expected to be availablefor switching. Several factors can be used in making this determination,for example:

-   -   a. The number of cars that are presently in the hump switch yard        10 and that are yet to be switched;    -   b. The rate or arrival of cars in the switch yard;    -   c. The rate at which cars are switched;    -   d. Resources available to prepare the cars for switching.

Factor (a) and factor (b) allow determining, at any given time, how manycars will be in the queue awaiting switching. Recall that thisinformation is readily available to the DTA controller 46 from the SRScomponent 30. Factor (c) can be a rate computed on the basis of theoperations in the hump switch yard 10 that occurred in the past coupleof hours. For example, a car switching rate can be computed on the basisof the number of cars switched in a given time frame, say the last twohours. A car switching rate can also be computed theoretically by takinginto account resources available (factor d) in the switch yard toperform the operations necessary to prepare the cars for switching. Onesuch operation is the mechanical inspection of the cars. One suchresource is the number of crews that can perform the preparation forswitching, namely the mechanical inspection. By considering the averagenumber of cars that a crew can mechanically inspect it is possible tocompute the rate at which cars can be made available for switching.Another possibility is to take into account the rate computed on thebasis of switching activities that have occurred in the past previoushours and adjust it to take into account variation in the number ofcrews, for instance increase the predicted rate if the number of crewsincreases or decrease the rate if fewer crews will be available.

The DTA controller 46 can on the basis of the above factors determinefor a given car, the number of cars that precede it in the humpingqueue. Then on the basis of the switching rate, an expected switchingtime for the car can be computed.

Note that the expected switching time for the car can remain static orcan be periodically updated, such as at each iteration cycle where a newswitching solution is computed. A static expected switching time is atime that once computed is re-used at every iteration cycle. Incontract, the expected switching time can be re-computed periodically asthe car moves up through the queue of cars that are to be switched. Inthis fashion, a more precise approximation can be obtained. The periodat which the expected switching time is re-computed can vary. Onepossibility is to do it at every iteration cycle at which a switchingsolution is computed.

At decision block 914 the process determines if there is an existingclassification track for the train block to which the car belongs. Thisquery will be answered in the affirmative if the car is not the firstcar of a train block. In other words, a classification track has alreadybeen assigned to the train block. On the other hand, if the car is thefirst car of the train block then the query will be answered in thenegative. If this query is answered in the affirmative, in other wordsthe car is not the first car in the train block and a classificationtrack 16 has already been assigned to this train block, then the processcontinues to step 916 shown at FIG. 8. Step 916 determines if the carwill in fact fit the classification track assigned to the train block.As it will be described below, in principle there should be enough spaceon the classification track 16 assigned to the train block since whenthe first car of the train block is switched, the switching solutionthat determines which classification track will receive the car, notonly looks for space for that particular car, but also for space forcars that belong to the train block and that will be subsequentlyswitched. This will be described later. So while in principle spaceshould be available, the step 916 still tests for available space totake into account some special factors. For instance, there may besituations when more than one classification track may have beenassigned to the train block in which case, the process will determinewhich classification track is the best candidate for receiving the car.In such case, the DTA controller 46 will determine the space availablein each assigned classification track 16. For the sake of this example,assume that two classification tracks 16 have been assigned to the trainblock. if not enough space is available in one of the classificationtracks 16 and space is available in the other classification track 16,the DTA controller 46 will compute a switching solution directing thecar to the classification track 16 having the requisite space. On theother hand, if space is available in both classification tracks 16, theDTA controller 46 will compute the best fit, in other words it willchose as a solution the classification track 16 that will leave theleast amount of free space when the car is switched to it.

When the step 916 is executed, the classification track 16 that istested for available space is retrieved from the memory of the DTAcontroller 46. In other words, when a classification track is assignedto the first car of a train block, the relationship between the trainblock and the classification track is stored in the memory of the DTAcontroller 46. When subsequent cars for that train block arrive and areto be switched, the DTA controller consults this information todetermine which classification track 16 has been assigned to the trainblock and will then test for available space there.

If the decision block 916 is answered in the negative, in other words nospace is available for the car in the classification track(s) assignedto the train block, then the processing continues with an overflow logicthread that aims to find a place for the car on another classificationtrack. The logic overflow process is shown by bloc 917. This logic isgenerally similar to the process starting at step 922 and ending at step940. Those steps will be described in greater detail later.

If decision bloc 916 is answered in the affirmative, the processcontinues with decision bloc 919 which determines which departure trainthe car will be directed to. Step 919 is an option that is useful incircumstances when the car has an expected switching time close to thepull time of the block. In other words, it may not be fully known at thetime the switching solution is computed if the car can make theclassification track before the pull time of the block. By default, thelogic of the DTA controller 46 is designed such as to try fitting thecar on the earliest departure train. So, the logic will computeswitching solutions that put the car in a train block having a departuretime close or slightly before the expected pull time (the extent of whatconstitutes “close” or “slightly before” is programmed in the DTAcontroller 46 and can be in its simplest for predetermined timeperiods). In some cases, the pull time may be delayed and the car willin fact make the current train. Similarly, the actual switch time of thecar can occur slightly before the expected switch time in which case thecar will also be able to make the current train.

In short, as long as the expected switching time is close enough to thepull time of the current block the DTA controller 46 will computeswitching solutions (step 921) that put the car with train blockscheduled to depart shortly. Only when the spread between the expectedswitching time and the pull time exceeds a threshold or the currentblock is actually pulled or for some other reason it becomes obviousthat the car cannot make the train scheduled to depart shortly, then adifferent switching solution is computed (step 923) that puts the car ina train block with a latest train. The label in FIG. 8 “same day train?”assumes that a departure train leaves every day. Hence, if the car doesnot make the current train, it will be put at step 923 at on the nextday train.

Referring back to FIG. 7, if decision step 914 is answered in thenegative, in other words no classification track has been yet assignedto the car because this is the first car of a train block, than theprocessing branches toward a series of steps that will first determineif it suitable to buffer this car instead of immediately switching it.The buffering process, identified by the reference numeral 927 includesa first decision step 931. That decision step assesses the desirabilityof temporarily putting the car, and perhaps the following cars thatbelong to the same train block, in the rehump tracks 26. Generally, itis desirable to limit as much as possible the amount of time cars from atrain block reside on the classification tracks 16 since the space thatis occupied by the cars cannot be used for any other purpose. Thisproblem may arise when the cars that make up a train block progressivelyarrive at the hump switch yard 10 over a long time period. For instance,when a first car is delivered, a switching decision is made and space isreserved for the entire train block on the classification tracks 16.That space, therefore, cannot be used for other purposes until the lastcar of the train block arrives, which may be many hours away. A possibleapproach is to use the rehump tracks 24 as a temporary buffer and thusfree space on the classification tracks 16. This option can beimplemented when certain conditions are met. Train block size is onethose conditions. It is desirable to put the car in the rehump tracks 24when the overall size of the train block is small. If the determinationat step 931 indicated that the size of the train block to which the carbelongs is small, among other conditions discussed below, the DTAcontroller 46 will compute a switching solution according to which thecar is directed to the rehump tracks 26. FIG. 10 is a flowchart of theprocess steps that take place under step 931.

The process starts at step 800. At step 802 the Number of Cars Remainingfor the Next departing Train (NCRNT) for a given train block iscomputed. The NCRNT is the number of cars for the train block that havean expected switching time before the scheduled pull time of the trainblock. NCRNT takes into account cars that are presently in the humpswitch yard 10 and also cars that have not yet arrived but have an ETAsuch that their expected switching time will still occur before thetrain block pull time. The DTA controller 46 receives information on thevarious parameters necessary to compute NCRNT from the SRS component 30,such as information on the identity of the train block and itscharacteristics, as well as the ETA of the cars that make up the trainblock. The DTA controller 46 can compute the expected switching time foreach car as described earlier and on the basis of the expected pull timeof the train block that is also available or derived from information inthe SRS component 30, the NCRNT value is computed.

At decision step 804 the DTA controller 46 determines whether a car willbe switched to classification tracks 16 or to the rehump tracks 26. Thedecision is based on the computed value NCRNT and the pull time of thetrain block from the classification track 16. In the specific example ofimplementation, if NCRNT is relatively small, less than 5 cars and thepull time of the train block is more than 7 hours away then a switchingsolution is computed to put the car in the rehump tracks 26 (step 806).Otherwise, the DTA controller 46 proceeds to step 933 in FIG. 7. Thespecific parameters in this example should not be interpreted in alimiting manner since those parameters can widely change withoutdeparting form the spirit of the invention. Specifically, For instance,the NCRNT parameter can be increased to more than 5 cars when the rehumptracks 26 have a lot of space and can accommodate a significant numberof cars. The 7 hours period can also be altered without departing fromthe spirit of the invention.

Decision step 933 tests for another condition that may result in the carbeing sent to the rehump tracks 26. This condition is the rate ofarrival of cars at the switch 24. If the rate is low, i.e., the carsmaking up the train block will have respective expected switching timesspread over a long time period, then it is advantageous to temporarilyplace the car on the rehump tracks before switching the car in any oneof the sets of classification tracks 16. The flowchart of FIG. 11illustrates this process.

The process starts at step 1100. At step 1102 the rate of arrival ofcars for the train block is computed. This rate is established bydetermining the number of cars that will be present in the hump switchyard 10 over a predetermined time period, say the next 5 hours. Thenumber of cars is the sum of the cars presently in the hump switch yard10 and those that are scheduled to arrive within the predetermined timeperiod. As with the previous example, this information is made availableto the DTA controller 46 from the SRS component 30. Decision step 1104determines if the rate of car arrival is above or below a threshold. Forexample the threshold may be five cars. So if the rate is five cars ormore in the next five hours, step 933 is answered in the negative.Otherwise, if the rate is less than five cars in the next five hours,then a switching solution to rehump the car is issued at (step 1108). Itwill be appreciated that the specific values provided are merelyexamples and they can be widely vary without departing from the spiritof this invention.

Note that the rate of arrival factor may also be refined by computingthe expected switching times of the cars making up the train blockinstead of the looking only at the number of cars of the train blockpresently in the hump switch yard 10 and the ETA of the cars that havenot yet arrived.

Assuming now that the decision step 933 is answered in the negative, inother words the conditions that would trigger a rehumping solution havenot been met, the process continues with decision step 920. In mostcases, when the processing reaches this step the car for which aswitching solution is being computed is the first car for a train block.Generally, the computations for finding a solution are more complex thanin the case when subsequent cars are switched since the DTA controller46 is not only looking for space for the first car but is also reservingspace for the subsequent cars of the train block.

Step 920 first looks for an empty classification track in the preferredgroup. When several empty classification tracks are available within thepreferred group, one option is to randomly choose one. This is suitablewhen all the empty classification tracks have the same capacity, inother words each empty classification track can accommodate the samenumber of cars. When empty classification tracks with differentcapacities are available an option is to choose the one that best fitsthe train block. In this context “best fit” means a classification trackthat will contain the least amount of empty space when the entire trainblock will be delivered in the classification track. The “best fit”computation can be done for each empty classification track bysubtracting the train block size from the track capacity. Thiscomputation can be made in terms of number of cars or in terms ofcumulative car length to take into account cars having differentlengths. If an empty classification track is found at step 920 aswitching solution is computed (step 935). Otherwise the processcontinues at decision step 922 which is the same as decision step 920except that the search for an empty classification track is done in thesecond most preferred classification track group. Again, if no solutionis found at step 922, step 924 performs the same operation, this timelooking for an empty classification track in the third most preferredclassification track group.

If anyone of the decision blocks 920, 922 or 924 is answered in theaffirmative, in other words an empty track is found for the train block,the DTA controller will make an entry in the records in its memory 49such as to associate the selected classification track with theparticular train block. Such association is made by marking the selectedempty classification track as “opened” and marking all the otherclassification tracks as “closed” as far as that train block isconcerned. As indicated above this is done by writing the appropriatedata in the computer files or records that the DTA controller 46processes to perform its management functions. Accordingly, whenswitching solutions are computed for any subsequent cars of that trainblock, all classification tracks that are marked “closed” aredisregarded and the search for switching options is constrained to the“opened” classification track.

Referring back to step 914, which is looking for an existing track for atrain block, the “closed” or “opened” status of the classification trackallows the DTA controller 46 to identify the correct classificationtrack that is to receive the car.

Once a classification track is marked as “opened” in connection with acertain train block, that classification track is also marked as“closed” for any other train block. This ensures that the classificationtrack will receive only cars for the relevant train block.

The “open” status of a classification track is negated when theswitching solution for the last car of the train block has beencomputed. In other words, the train block is now complete. Similarly,the “closed” status of the classification track with regard to any othertrain block is also negated, thus allowing cars of another train blockto be directed to the classification track.

If no switching solutions have been found at anyone of the steps 920,922 and 924, indicating that no empty tracks for the train block areavailable in anyone of the preferred classification groups, the DTAcontroller 46 continues with decision step 926 that tries to find spacefor the train block in an already occupied track.

The process will try to find space first in the most preferred group,then the second most preferred group, then the third most preferredgroup before considering other options. The decision step 926 tries todetermine if an occupied classification track 16 exist in the mostpreferred group that can accommodate the train block or a portionthereof. As discussed previously, the DTA controller 46 will consideronly those classification tracks 16 that have train blocks marked“complete”, hence the track is open to receive a new train block. Allthe other classification tracks 16 in the most preferred group that holdcars but where the train blocks are not yet complete are from a logicalprocess point of view marked “closed”. Assuming that the process locatesa single occupied track with a closed train block, hence available toreceive a new train block, the process will then determine if enoughspace exist for the new train block on the track.

In a specific and non-limiting example of implementation, the availablespace in the classification track equals not the currently availablespace on the classification tracks but the space that is made availableto the new train block considering that train blocks currently occupyingthe set of classification tracks will be pulled at certain times in thefuture (train block pull profile vs. car arrival profile).

More specifically, the computation of the available space takes intoaccount the pull time of the train block that currently occupies thetrack and the ETA, or expected switching time of the cars that make upthe train block for which space is being sought. For instance, assume aclassification track 16 having a 50 car capacity. Train block A made upof 30 cars that occupies the classification track 16 is scheduled to bepulled at noon (current time is 10:00 AM). The DTA controller 46 needsdetermining if there is available space for departure train block B thatis made up of 40 in the same classification track 16. The arrivalprofile of the cars making up train block B in the classification track16 is such that 19 cars will arrive at 11:00 AM, 5 at 3:00 PM and 16 at3:30 PM. The computation of the available space in the classificationtrack 16 is done at different points in time that generally coincidewith the arrival of the cars making up train block B. For instance theavailable space at the following times will be:

-   -   11:00 AM—one car;    -   12:00 AM—19 cars considering that train block A was pulled;    -   3:00 PM—24 cars;    -   3:30 PM—10 cars.

By checking if available space exist at the ETA, or expected switchingtime of each car in the new train block, the process can determine if,enough space will exist for it in the classification track 16. The trainblock B is deemed to “fit” in the classification track 16 if for everytrain block B car that arrives, space exists to receive it.

In determining the time at which cars arrive in the classification track16, one option is to use only the ETA of the cars available from the SRScomponent 30. The ETA provides a rough estimate of the time the carswould be present in the classification track since it does not take intoaccount the preparation time for switching such as the mechanicalinspection. Never the less, in some applications the ETA can provide areasonable indication of the time the cars will arrive in theclassification track 16 and as to make the assessment. Another morerefined option is to use the expected switching time of the cars whichis computed as described earlier.

In the case where the process finds a single classification track 16that can accommodate the new train block then the process terminates byissuing the switching solution. However, in the instance where severalclassification tracks exist in the most preferred group ofclassification tracks that can all hold a complete train block, and thatcan accommodate the new train block, hence the new train block “fits”two or more classification tracks in the most preferred group, then anumber of options arise that are considered by the DTA controller 46 tofind the best solution. This situation is illustrated in the flowchartat FIG. 9. The process starts at 700. At step 706 the process willcompute the degree of “fit” in each classification track that can holdthe new block. The degree of “fit” is represented by the Left Over Room(LOR) for each classification track option. The LOR is the free space inthe classification track that will remain after all the cars of the newtrain block cars have arrived. In the above example, the LOR at 3:30will be of 10 cars.

In FIG. 9 the DTA controller 46 will select at step 710 theclassification track that has the lowest LOR and thus provides the best“fit”. Since LOR is space that is difficult to use in practice,selecting the classification track with the lowest LOR results in mostcases in a better utilization of the available space.

When a classification track has been found to accommodate the new trainblock, then the records of the DTA controller 46 are marked such that:

-   -   For every car of the new train block all the classification        tracks 16 will be seen as “closed”, hence not available, with        the exception of the selected classification track 16. This        ensures that the subsequent cars of the new train block will be        constrained to go to the selected classification track 16.    -   The selected classification track 16 will appear as “closed” for        every car that belongs to a train block other than the new train        block. Again this ensures that only cars from the new train        block are directed to the selected classification track 16. The        selected classification track will be released from the “closed”        status only when the new train block is completed, in other        words all the cars from that train block have been delivered in        the selected classification track 16.

Now assume, for example, that the process under step 926 in FIG. 7 failsto identify an occupied track in the most preferred track group that canhold the entirety of the new train block. The next step is to terminateprocess step 926 and initiate process step 928. Process step 928 issimilar to process step 926 with the exception that it looks for spacefor the new train block in the second preferred group of classificationtracks. Similarly, if no space can be found for the new train block inthe second preferred group of classification tracks, the processcontinues to step 930 that will consider the third preferred group ofclassification tracks.

If no space is available in anyone of the preferred groups then theprocess will look for space outside the preferred groups. The samepattern described earlier will be repeated. More specifically, the step932 will search for an empty classification track but outside thepreferred groups (most, second and third). If such an emptyclassification track is found then a switching solution is issued.Otherwise, the process continues with step 934 that will consider alloccupied tracks with closed train blocks outside the preferred groups.

If no space for the train block has been found so far, the processcontinues with step 936 which is described in greater detail withreference to the flowchart on FIG. 12. This point in the overall processindicates that no classification track 16 exists that can accommodatethe entire train block. The DTA controller 46 will now try identifying aclassification track 16 that can accommodate most of the train block butnot all of it.

The process starts at step 1402. At step 1404 the DTA controller 46 willcompute the available space on each set of most preferred classificationtracks 16 with closed train blocks (i.e. classification tracks 16 thatcan receive cars from another train block). Classification tracks 16with train blocks that are still open are disregarded. The computationof the available space takes into account the pull profile of theexisting train block(s) and the arrival profile of the cars of thecurrent train block as described earlier. The result of the availablespace computation essentially determines how many cars will fit in eachclassification track with a closed train block. The DTA controller 46retains in memory the classification track 16 that can hold the largestnumber of cars.

The same computation is performed in connection with the classificationtracks 16 in the second preferred group (step 1406), in the thirdpreferred group (step 1407) and then for classification tracks (step1408) other than those in the most preferred, the second preferred group(step 1406) and the third preferred group (step 1407).

The results of the four computation operations are compared at decisionstep 1410. Generally, the selection logic is designed to favor aclassification track according to the following order of preference:

-   -   the most preferred group of classification tracks;    -   the second preferred group of classification tracks;    -   the third preferred group of classification tracks;    -   Tracks that are outside the most preferred, second preferred and        third preferred groups of classification tracks.        This order of preference is applied unless a classification        track at a less preferred level can hold significantly more        cars.

One example of decision thresholds is to select a classification trackin the most preferred group unless the available classification trackfrom the second preferred group can hold at least 5 more cars. The sameor different threshold can be applied to other preference levels aswell. For example the classification track returned by step 1407 (thirdpreferred classification track) is selected if it can accommodate 10cars or more than the classification track in the second preferredgroup.

Once the decision on which classification track 16 to use is made andthe appropriate records in the DTA controller 46 are marked to open thatclassification track only to cars of the new train block and similarlyclose the selected classification track 16 to cars from any other trainblock, then a processing is initiated to determine how to handle theoverflow. Several options exist:

-   -   Direct the excess cars to rehump tracks 26. This option is        suitable if the number of excess cars is low. So, for instance,        a threshold could be set such that if the number of excess cars        is at or below the threshold they are directed to the rehump        tracks 26. In a specific and non-limiting example of        implementation, the threshold could be five cars. The DTA        controller 46 will then mark its records that the cars which        make up the overflow are to be sent to the rehump tracks 26. For        instance, each car object of the train block can be marked by        the DTA controller 46 to the effect that it has only two        switching options, one being the rehump tracks 26 and the other        the selected classification track 16.

Since the classification track 16 is full when the car arrives at thehump, the logic will direct the car to the rehump tracks 26. When thecars in the rehump tracks are humped, then the logic is run one moretime and if space is now available in the selected classification track,then the switching solution to direct one or more cars in thatclassification track 16 is issued.

-   -   Place the cars of the train block in two separate classification        tracks. In other words, the overflow is sent to a different        classification track 16 instead of waiting for space to be        available in the selected classification track 16. Under this        option, the train block as far as its processing by the DTA        controller 46 is concerned is handled as two separate train        blocks, which are to travel on the same departure train. In        other words the selected classification track 16 that holds the        initial part of the train block is considered to hold a closed        train block, in other words no further cars are expected in that        classification track 16 for the same train block. At the same        time, the overflow is considered from the point of view of the        DTA controller 46 logic to become a train block and it is        treated as such. The logic starting from step 920 is performed        to find a suitable location for that “new” train block. Since it        will not be desirable to locate the overflow physically remote        from the initial part of the train block, the logic may be        constrained to look for space only in the most preferred        classification track. Finally, the logic also needs to take into        account constraints that arise at train block pull time due to        the train block splitting. In particular it would be highly        desirable to synchronize the train block pulling operation on        the two classification tracks such that the train block parts        are physically joined to one another in the departure train;    -   Pre-empt the selected classification track (step 938 in FIG. 7).        This option is an extension of the second option above, the        exception being that two train blocks are being created out a        single train block. Recall that in the previous case, the train        block splitting was only an operation internal to the DTA        controller 46 and the result was still a single train block, as        far as the departure train is concerned. Here, a single train        block creates “officially” two separate train blocks. The new        train block that is made up of the overflow has essentially the        same properties as the original train block, such as        destination, etc, with some differences such as the number and        identity of cars that make up the new train block. Moreover, the        original train block also needs to change in that now it has        fewer cars. Finally, the departing train object also needs to be        updated, since it now contains one more train block. Those        changes are handled by modifying the records in the DTA        controller 46. Since the DTA controller 46 is aware of the        identity of the cars making up the overflow, it will:        -   Create a new train block object to encompass the overflow by            also copying relevant properties from the prior train block            object (such as destination, etc.);        -   Modify the existing train block object by adjusting for the            cars that have been excised and are now part of the newly            created train block object;        -   Update the train object to add to it a new train block            object.

All those changes must also be communicated to the SRC component 30 suchthat the railway operations, once the train has left the hump switchyard 10 can be conducted by taking into account the existence of a newtrain block. The necessary information can be communicated to the SRScomponent 30 manually. This can be done by an operator that will accessthe system and make the necessary changes. Another possibility is toallow the DTA controller 46 to communicate directly with the SRScomponent 30 such as to change the records of the SRS component 30.

If the step 938 is answered in the negative, in other words a switchingsolution is not possible, the final option is the step 940 that issues aswitching solution to sends the car to the rehump tracks 24.

In the above examples, the DTA controller 46 is designed to compute aswitching solution and tell the yard master or any other operator wherethe car should go. In this embodiment, the DTA controller 46 assistswith the switching process and it is up to the yard master to validatethe choices made by the DTA controller 46 and then authorize theirimplementation. In a possible variant, not shown in the drawings, theDTA controller 46 can be designed such as to communicate switchingcommands directly to the HPCS component 32. In this fashion, the DTAcontroller 46 will cause the HPCS component 32 to implement theswitching solutions, bypassing the human operator. This system wouldrequire a communication link between the DTA controller 46 and the HPCScomponent 32 over which commands and data can be exchanged between bothentities.

A possible variant to the general process described earlier inconnection with FIGS. 8 and 9 is to provide a special treatment of emptycars in order to take advantage of the inherent flexibility theypossess, in terms of being substitutable for one another. Cars thatcarry goods have to be switched in a way to reach the destination of thegoods. In contrast, a given empty car does not need to comply with thepreset trip plan. What matters from a customer's perspective is toreceive an empty car; it is far less critical which specific car isbeing sent since any empty car (that matches the customer requirements)will do.

In summary, the process described in FIGS. 8 and 9 treats the empty carsas any other car and they are switched as per the parametersestablishing which train block they go to. FIG. 13 shows a variant wherethe specificity of the empty cars is recognized by the DTA controller 46such as to perform substitutions, wherever possible.

The process starts at 1300. At step 1302 the DTA controller willidentify all the empty cars in the hump yard 10. In essence the DTAcontroller 46 maintains in the memory 49 a list of all the empty carsthat are currently in the hump switch yard 10 and that have not yet beenswitched. This list is continuously being updated to take into accountcars that are being switched and cars that are arriving with inboundtrains. Every time an empty car is switched and placed in aclassification track 16 the list is updated to remove that car from thelist. Similarly, every time a new train arrives, if that train containsempty cars they are added to the list.

The DTA controller 46 is capable of distinguishing between empty carsand cars that are not empty by inspecting the records associated withthe respective car objects available from the SRS component 30.

The DTA controller 46 computes at step 1304 the expected switching timeof each empty car in the dynamic list maintained by the DTA controller46. The expected switching time is an information that can be added tothe list or it can be cross-referenced on the basis of the car IDinformation. In other words, the DTA controller 46 can be designed suchthat it computes the expected switching time for all cars in the humpyard 10 yet to be switched and the expected switching time for the emptycars can be extracted on the basis of car ID information.

At step 1306 the DTA controller 46 will identify all the train blocksthat the switch yard 10 is to make (departing train blocks) that havenot yet been pulled and that contain empty cars. Again thisidentification is made based on the records provided by the SRScomponent 30. The inquiry made at step 1306 will essentially produce alist of train blocks that contain empty cars. Those departure trainblocks are either in the process of being assembled or will be assembledin the future. Note that the train blocks identified at step 1306 aredefined in the DTA controller 46 records in terms of specific carsmaking up the train blocks. In other words, a train block containing oneor more empty cars specifies unique car ID numbers, not just any emptycar.

At step 1308 the DTA controller 46 will determine if anyone of thespecific empty cars required for the train blocks to be assembled willbe available on time. Available on time means that the particular emptycar has an expected switching time prior to the pull time of the block.Step 1308 is expected to produce a shorter list of blocks containingempty cars where at least one empty car specified for each block willnot be available on time. This may be caused by the arrival train thatbrings the empty car being late. Since the DTA controller 46 is madeaware of the ETA of each car via the SRS component 30 it can determinefor any given car if can be switched before the pull time of thedeparting train block.

Decision step 1310 determines if an empty car substitution is possible.Once a block has been identified where an empty car will be late, theDTA controller 46 looks for other empty cars in the hump switch yard 10that can be substituted to the late car. Since a list of all the emptycars in the hump switch yard 10 has been compiled at step 1302 and theirrespective expected switching times are known, then the DTA controller46 can determine by searching that list if there is an empty car havingan expected switching time before the pull time of the block, henceavailable to be substituted for the missing or late car. If asubstitution is possible then the substitution is performed. Thisentails switching the car ID numbers in the records associated with thetwo cars. Specifically, the ID of the car that is currently available inthe hump switch yard 10 replaces the ID of the car that is late in allthe records of the DTA controller 46 and also in the records of the SRScomponent 30. Similarly, the ID of the car that is presently in the humpswitch yard 10 is replaced by the ID of the car that is late. Hence,when the car that is late actually arrives it will be directed to thetrain block that was to receive the other car.

If no substitution is possible, in other words the decision step 1310 isanswered in the negative, the DTA controller 46 does nothing and thesituation is handled as per the process described in connection withFIGS. 8 and 9.

A variant of the process illustrated in FIG. 13 is shown at FIG. 14. Theprocess starts at 1400. At steps 1402 and 1404 a list is made of theempty cars available in the hump switch yard 10 and their respectiveexpected switching times. Those steps are identical to steps 1302 and1304 described earlier. Next, step 1406 identifies the train blocks tobe assembled that contain empty cars, similar to step 1306. At step 1308the DTA controller 46 will compute a best fit map, trying to match theavailable empty cars to the demand, i.e., the empty car slots in thedeparture train blocks. The best fit algorithm can match an empty car toan empty car slot in a departure train block when the expected switchingtime for the empty car has not exceeded the pull time of the departuretrain block. As a match is found, the DTA controller 46 will write atstep 1410 the car ID number in all the electronic records of the emptycar that is part of the departure train block. Specifically, the recordsof the DTA controller 46 that issue switching solutions will indicatethe particular empty car is to be directed to the classification trackthat contains other cars of the block and also data is communicated tothe SRS component 30 such that the SRS component 30 is made aware of theassociation of that specific empty car with the train block.

The embodiment in FIG. 14 is different from the embodiment in FIG. 13 inthat at the onset a pool of empty cars is created and as an empty car isneeded for a departure train block, then an empty car is taken from thepool, the choice as to which car to take is made on the basis of theexpected switching time of the car and the pull time of the departuretrain block.

A possible refinement of the empty car substitution process is toperform the substitution as described earlier but to classify the emptycars according to type, style or category. In many cases, not all emptycars that are placed on the railroad network can be substituted for oneanother. For example, an empty box car to carry dry goods is not likelyto be substitutable to an empty car to carry liquids, for obviousreasons. Accordingly, the above substitution process is preformed in thesame manner but for specific car categories. This allows performingsubstitution only among cars that can perform similar or identicalfunctions. Specifically, if a car to carry liquid goods is late ormissing only a similar category car will be allowed to substitute themissing or late car.

The manner in which this refinement is implemented is to create carcategories in the records of the DTA controller 46. In a given categoryone car can be substituted in terms of functionality to any other car inthe same category. The number of categories can vary and will depend onthe number of different types of cars in circulation on the railroadnetwork. For each car category the substation logic described earlier isrun. This ensures that in the case of a substitution the customer willreceive a car that will match his/her requirements.

Although various embodiments have been illustrated, this was for thepurpose of describing, but not limiting, the invention. Variousmodifications will become apparent to those skilled in the art and arewithin the scope of this invention, which is defined more particularlyby the attached claims.

1) A system for computing car switching solutions in a railway switchyard containing a plurality of classification tracks wherein a firstclassification track holds a first train block and a secondclassification track holds a second train block, said system comprising:a) a processing entity for: i) computing available space in the firstclassification track for receiving cars from a third train block that isdifferent from the first and second train blocks; ii) computingavailable space in the second classification track for receiving carsfrom the third train block; iii) selecting among the first and secondclassification tracks at least in part on the basis of the computing ofavailable space; iv) computing switching solutions for cars of the thirdblock on the basis of the selecting; b) an output for releasing dataconveying one or more of the car switching solutions. 2) A system asdefined in claim 1, wherein said output includes a user interfaceallowing communicating to a user the car switching solutions. 3) Asystem as defined in claim 1, wherein said output is intended forconnection to a car switch control system that derives car switchingcommands from the data conveying one or more of the car switchingsolutions. 4) A system as defined in claim 1, wherein said processingentity computes an expected switch time for one or more cars that belongto the third block and uses the computed expected switch time to computecar switching solutions for cars that belong to the third block. 5) Asystem as defined in claim 1, wherein the railway switch yard has aswitching queue containing a plurality of cars to be sequentiallyswitched to classification tracks, said processing unit computingmultiple switching solutions for one or more cars as the one or morecars progress through the switching queue. 6) A system as defined inclaim 1, wherein said input receives data indicative of an ETA at theswitch yard of a car that belongs to the third train block, saidprocessing unit computing one or more car switching solutions by usingthe data indicative of an ETA as a factor. 7) A system as defined inclaim 1, wherein the switch yard is a hump switch yard. 8) A system asdefined in claim 1, wherein the switch yard is a flat switch yard. 9) Amethod for computing car switching solutions in a railway switch yardcontaining a plurality of classification tracks wherein a firstclassification track holds a first train block and a secondclassification track holds a second train block, said method comprising:a) computing with a computing entity an available space in the firstclassification track for receiving cars from a third train block that isdifferent from the first and second train blocks; i) computing with thecomputing entity available space in the second classification track forreceiving cars from the third train block; ii) selecting among the firstand second classification tracks at least in part on the basis of thecomputing of available space; iii) computing switching solutions forcars of the third block on the basis of the selecting; b) an output forreleasing data conveying one or more of the car switching solutions. 10)A method as defined in claim 9, including communicating to a user thecar switching solutions. 11) A method as defined in claim 9, includingcommunicating the data conveying one or more of the car switchingsolutions to a car switch control system that derives car switchingcommands from the data conveying one or more of the car switchingsolutions. 12) A method as defined in claim 9, including computing anexpected switch time for one or more cars that belong to the third blockand using the computed expected switch time to compute car switchingsolutions for the one or more cars that belong to the third block. 13) Amethod as defined in claim 9, wherein the railway switch yard has aswitching queue containing a plurality of cars that belong to the thirdblock to be sequentially switched to classification tracks, said methodincluding computing multiple switching solutions for the one or morecars that belong to the third block as the one ore more cars progressthrough the switching queue. 14) A method as defined in claim 9,including receiving at said input data indicative of an ETA of a car atthe switch yard that belong to third block, said method furtherincluding computing a one or more car switching solution by using thedata indicative of an ETA as a factor. 15) A method as defined in claim9, wherein the switch yard is a hump switch yard. 16) A method asdefined in claim 9, wherein the switch yard is a flat switch yard.